The Dirichlet problem for a thin rectangle

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Existence Results for a Dirichlet Quasilinear Elliptic Problem

In this paper, existence results of positive classical solutions for a class of second-order differential equations with the nonlinearity dependent on the derivative are established. The approach is based on variational methods.

متن کامل

On the Dirichlet Problem in a Characteristic Rectangle for Fourth Order Linear Singular Hyperbolic Equations

In the rectangle D = (0, a) × (0, b) with the boundary Γ the Dirichlet problem ∂4u ∂x2∂y2 = p(x, y)u + q(x, y), u(x, y) = 0 for (x, y) ∈ Γ is considered, where p and q : D → R are locally summable functions and may have nonintegrable singularities on Γ. The effective conditions guaranteeing the unique solvability of this problem and the stability of its solution with respect to small perturbati...

متن کامل

On the Correctness of the Dirichlet Problem in a Characteristic Rectangle for Fourth Order Linear Hyperbolic Equations

It is proved that the Dirichlet problem is correct in the characteristic rectangle Dab = [0, a] × [0, b] for the linear hyperbolic equation ∂4u ∂x2∂y2 = p0(x, y)u + p1(x, y) ∂u ∂x + p2(x, y) ∂u ∂y + +p3(x, y) ∂2u ∂x∂y + q(x, y) with the summable in Dab coefficients p0, p1, p2, p3 and q if and only if the corresponding homogeneous problem has only the trivial solution. The effective and optimal ...

متن کامل

Heuristics for the Rectangle Packing Problem

In this paper the rectangle packing problem (RPP) is considered. The RPP consists in finding a packing pattern of small rectangles within a larger rectangle such that the area utilization is maximized, We develop new heuristics for the RPP which are based on the G4-heuristic for the pallet loading problem. In addition to the general RPP we take also into account further restrictions which are o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 1967

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091500011974